Similarity reduction of matrix over a quaternion division ring

Diagonal Matrix Reduction over Refinement Rings

  Abstract: A ring R is called a refinement ring if the monoid of finitely generated projective R- modules is refinement.  Let R be a commutative refinement ring and M, N, be two finitely generated projective R-nodules, then M~N  if and only if Mm ~Nm for all maximal ideal m of  R. A rectangular matrix A over R admits diagonal reduction if there exit invertible matrices p and Q such that PAQ is...

Matrix Theory over the Complex Quaternion Algebra

We present in this paper some fundamental tools for developing matrix analysis over the complex quaternion algebra. As applications, we consider generalized inverses, eigenvalues and eigenvectors, similarity, determinants of complex quaternion matrices, and so on. AMS Mathematics Subject Classification: 15A06; 15A24; 15A33

On the diameter of the commuting graph of the full matrix ring over the real numbers

‎In a recent paper C‎. ‎Miguel proved that the diameter of the commuting graph of the matrix ring $mathrm{M}_n(mathbb{R})$ is equal to $4$ if either $n=3$ or $ngeq5$‎. ‎But the case $n=4$ remained open‎, ‎since the diameter could be $4$ or $5$‎. ‎In this work we close the problem showing that also in this case the diameter is $4$.

Triangulaizability of Algebras Over Division Rings

An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form

An orthogonal similarity reduction of a matrix to semiseparable form. Abstract It is well known how any symmetric matrix can be reduced by an orthogonal similarity transformation into tridiagonal form. Once the tridiagonal matrix has been computed, several algorithms can be used to compute either the whole spectrum or part of it. In this paper, we propose an algorithm to reduce any symmetric ma...